Draft: Eecient Algorithm for Nding Two Largest Empty Circles
نویسنده
چکیده
This paper considers the problem of nding of 2 largest equal-radius non-overlapping circles in a simple polygon. We present O(n log 3 n) algorithm for nding disks in a polygon with n vertices. It improves recent algorithm of Bield et al. 1] that takes at least (n 2) time.
منابع مشابه
Computing All Conic Sections in Torus and Natural Quadric Intersections
Conic sections embedded in a torus must be circles of special types: (i) proole circles, (ii) cross-sectional circles , and (iii) Yvone-Villarceau circles. Based on this classiication, we present eecient and robust geometric algorithms that detect and compute all degenerate conic sections (circles) in torus/plane and torus/natural-quadric intersections. 2 Introduction Simple surfaces (such as p...
متن کاملComputational geometry and the design of aperture-synthesis telescopes I. A measure of the quality of the uv-plane coverage
When designing an aperture-synthesis telescope for use in astronomy it is essential to find a layout of the antennas on the site that provides good coverage of the uv-plane. Large holes in the distribution of baseline points in that plane are particularly undesirable, and so an algorithm was devised for locating all the holes in any given design and assessing whether they are unacceptably large...
متن کاملPractical Parallel Algorithms for Dynamic Data Redistribution, Median Finding, and Selection (preliminary Draft)
A common statistical problem is that of nding the median element in a set of data. This paper presents a fast and portable parallel algorithm for nding the median given a set of elements distributed across a parallel machine. In fact, our algorithm solves the general selection problem that requires the determination of the element of rank i, for an arbitrarily given integer i. Practical algorit...
متن کاملComputing Largest Empty Circles with Location Constraints 1 ' 2
Let Q = {qj, qz,..., qn / be a set of n points on the plane. The largest empty circle (LEC) problem consists in finding the largest circle C with center in the convex hull of Q such that no point q(C Q lies in the interior of C. Shamos recently outlined an O(n log n) algorithm for solving this problemJ 9) In this paper it is shown that this algorithm does not always work correctly. A different ...
متن کاملPattern discovery methods for protein topology diagrams
We are carrying out research into developing several approaches to pattern discovery in protein topology diagrams, and comparing them. The underlying motivation is to eeciently automatically generate patterns classifying sets of proteins and to apply this to characterising databases of protein structure. We are using TOPS protein topology diagrams, which we have formalised as a restricted kind ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1999